On furnishing Room squares

Secret Sharing Schemes Based on Room Squares

In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares.

Compatibly ordered Room squares

Perfect Secret Sharing Schemes from Room Squares

Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares

Room squares with holes of sides 3, 5, and 7

We investigate Room squares and subsquares. All terminology is as in [6] and [7], and we will assume the reader is familiar with the definitions contained therein. (These include group-divisible designs, transverial designs, and frames.) We will refer to an incomplete Room square of side s missing a subsquare of side t as an (s, t)-incompZefe Room square. It is known that for any odd t, there i...

On Packing Squares with Equal Squares

The following problem arises in connection with certain multidimensional stock cutting problems : How many nonoverlapping open unit squares may be packed into a large square of side a? Of course, if a is a positive integer, it is trivial to see that a2 unit squares can be successfully packed . However, if a is not an integer, the problem becomes much more complicated . Intuitively, one feels th...